Deciding minimal distinguishing DFAs is NP-complete

In this paper, we present a proof of the NP-completeness of computing the smallest Deterministic Finite Automaton (DFA) that distinguishes two given regular languages as DFAs. A distinguishing DFA is an automaton that recognizes a language which is a subset of exactly one of the given languages. We establish the NP-hardness of this decision problem by providing a reduction from the Boolean Satisfiability Problem (SAT) to deciding the existence of a distinguishing automaton of a specific size

Deciding minimal distinguishing DFAs is NP-complete

In this paper, we present a proof of the NP-completeness of computing the smallest Deterministic Finite Automaton (DFA) that distinguishes two given regular languages as DFAs. A distinguishing DFA is an automaton that recognizes a language which is a subset of exactly one of the given languages. We establish the NP-hardness of this decision problem by providing a reduction from the Boolean Satisfiability Problem (SAT) to deciding the existence of a distinguishing automaton of a specific size

Unbiased protein association study on the public human proteome reveals biological connections between co-occurring protein pairs

Mass-spectrometry-based, high-throughput proteomics experiments produce large amounts of data. While typically acquired to answer specific biological questions, these data can also be reused in orthogonal wayS to reveal new biological knowledge. We here present a novel method for such orthogonal data reuse of public proteomics data. Our method elucidates biological relationships between proteins based on the co-occurrence of these proteins across human experiments in the PRIDE database. The majority of the significantly co-occurring protein pairs that were detected by our method have been successfully mapped to existing biological knowledge. The validity of our novel method is substantiated by the extremely few pairs that can be mapped to existing knowledge based on random associations between the same set of proteins. Moreover, using literature searches and the STRING database, we were able to derive meaningful biological associations for unannotated protein pairs that were detected using our method, further illustrating that as-yet unknown associations present highly interesting targets for follow-up analysis

Computing minimal distinguishing Hennessy-Milner formulas is NP-hard, but variants are tractable

We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is NP-complete. However, we can provide polynomial algorithms, if minimality is formulated as the minimal number of nested modalities, and it can even be extended by recursively requiring a minimal number of nested negations. A prototype implementation shows that the generated formulas are much smaller than those generated by the method introduced by Cleaveland.Comment: Accepted at CONCUR 202

Non-invasive imaging of hypoxia in tissue engineering

In tissue engineering, cells are grown on biomaterials in vitro and subsequently implanted. A critical parameter in effective proliferation and differentiation is the availability of nutrients. Few tools are currently available to monitor the nutritional status of cells. In this study, we have employed A4-4 cells [1], a Chinese hamster ovary cell line stably transfected with a luciferase gene driven by the hypoxia responsive element (HRE) from the promoter region of the VEGF gene [2, 3]. HRE activity, and thus luciferase activity, directly correlates with decreasing cellular O2 levels.The aim of this study is to investigate whether the HREluciferase construct can be used for non-invasive imaging of hypoxia in tissue engineering

Computing Minimal Distinguishing Hennessy-Milner Formulas is NP-Hard, but Variants are Tractable

We study the problem of computing minimal distinguishing formulas for non-bisimilar states in finite LTSs. We show that this is NP-hard if the size of the formula must be minimal. Similarly, the existence of a short distinguishing trace is NP-complete. However, we can provide polynomial algorithms, if minimality is formulated as the minimal number of nested modalities, and it can even be extended by recursively requiring a minimal number of nested negations. A prototype implementation shows that the generated formulas are much smaller than those generated by the method introduced by Cleaveland

Civil society meetings in EU trade agreements: recommendations and lessons for EPAs

EU trade agreements increasingly involve civil society to discuss and monitor sustainable development. Evaluations of these civil society meetings vary widely from being mere talking shops to empowering platforms. The new EPAs have weak or no provisions on civil society involvement and should be strengthened in this regard. In order to maximise the full potential of these meetings, lessons can be drawn from the existing mechanisms